Rate-Distortion Optimal Mesh Simplification for Communications
نویسنده
چکیده
The thesis studies the optimization of a specific type of computer graphic representation: polygon-based, textured models. More precisely, we focus on meshes having 4-8 connectivity. We study a progressive and adaptive representation for textured 4-8 meshes suitable for transmission. Our results are valid for 4-8 meshes built from matrices of amplitudes, or given as approximations of a subdivision surface. In the latter case, the models can have arbitrary topology. In order to clarify our goals, we first describe a transmission system for computer graphics models (Chapter 1). Then, we review approximation techniques (Chapter 2) and study the computational properties of 4-8 meshes (Chapter 3). We provide an efficient method to store and access our dataset (Chapter 4). We address the problem of 4-8 mesh simplification and give an efficient (n logn) algorithm to compute progressive and adaptive representations of 4-8 meshes using global error (Chapter 5). We study the joint optimization of mesh and texture (Chapter 6). Finally, we conclude and give future research directions (Chapter 7).
منابع مشابه
Progressive Meshes in an Operational Rate-Distortion Sense with Application to Terrain Data
This paper presents an efficient simplification method for regular meshes obtained with a binary subdivision scheme. Our mesh connectivity is constrained with a quadtree data structure. We propose a quadtree built especially for this class of meshes having a constant-time traversal property. We introduce a rate-distortion (RD) framework to decimate the mesh and build a progressive representatio...
متن کاملComputational analysis of mesh simplification using global error
Meshes with (recursive) subdivision connectivity, such as subdivision surfaces, are increasingly popular in computer graphics. They present several advantages over their Delaunay-type based counterparts, e.g., Triangulated Irregular Networks (TINs), such as efficient processing, compact storage and numerical robustness. A mesh having subdivision connectivity can be described using a tree struct...
متن کاملCompression progressive et tatouage conjoint de maillages surfaciques avec attributs de couleur. (Progressive compression and joint compression and watermarking of surface mesh with color attributes)
The use of 3D models, represented as a mesh, is growing in many applications. For efficient transmission and adaptation of these models to the heterogeneity of client devices, progressive compression techniques are generally used. To protect the copyright during the transmission, watermarking techniques are also used. In this thesis, we first propose two progressive compression methods for mesh...
متن کاملA Qualitative Comparison of Some Mesh Simplification Software Packages
Simplification of polygonal meshes enables accelerated rendering of large 3D scenes without compromising the visual quality of the result. The performance of a number of software packages for mesh simplification, including both commercial and academic offerings, are compared in this survey. We analyze the geometric distortion of the simplified version relative to the original, as measured by th...
متن کاملNew adaptive interpolation schemes for efficient meshbased motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001